High frequency scattering by convex curvilinear polygons
نویسندگان
چکیده
We consider scattering of a time-harmonic acoustic incident plane wave by a sound soft convex curvilinear polygon with Lipschitz boundary. For standard boundary or finite element methods, with a piecewise polynomial approximation space, the number of degrees of freedom required to achieve a prescribed level of accuracy grows at least linearly with respect to the frequency of the incident wave. Here we propose a novel Galerkin boundary element method with a hybrid approximation space, consisting of the products of plane wave basis functions with piecewise polynomials supported on several overlapping meshes; a uniform mesh on illuminated sides, and graded meshes refined towards the corners of the polygon on illuminated and shadow sides. Numerical experiments suggest that the number of degrees of freedom required to achieve a prescribed level of accuracy need only grow logarithmically as the frequency of the incident wave increases.
منابع مشابه
Guarding curvilinear art galleries with vertex
10 One of the earliest and most well known problems in computational geometry is 11 the so-called art gallery problem. The goal is to compute the minimum number of 12 guards needed to cover the interior of any polygon with n vertices; the guards are 13 to be placed on the vertices of the polygon. We consider the problem of guarding an 14 art gallery which is modeled as a polygon with curvilinea...
متن کاملA Boundary Element Method for High Frequency Scattering by Convex Polygons
Standard boundary or finite element methods for problems of high frequency acoustic scattering by convex polygons have a computational cost that grows in direct proportion to the frequency of the incident wave. Here we present a novel Galerkin boundary element method, using plane wave basis functions on a graded mesh, for which the number of degrees of freedom required to achieve a prescribed l...
متن کاملGuarding curvilinear art galleries with vertex or point guards
One of the earliest and most well known problems in computational geometry is the socalled art gallery problem. The goal is to compute the minimum possible number guards placed on the vertices of a simple polygon in such a way that they cover the interior of the polygon. In this paper we consider the problem of guarding an art gallery which is modeled as a polygon with curvilinear walls. Our ma...
متن کاملAN hp-BEM FOR HIGH FREQUENCY SCATTERING BY CONVEX POLYGONS
Time harmonic acoustic scattering by convex polygons is considered. Standard schemes with piecewise polynomial approximation spaces have a computational cost that grows at least linearly with respect to the wavenumber. Here we extend a h-version Galerkin boundary element method scheme for this problem developed by ChandlerWilde and Langdon to an hp-version of the BEM, for which we demonstrate a...
متن کاملA High Frequency hp Boundary Element Method for Scattering by Convex Polygons
In this paper we propose and analyse a hybrid hp boundary element method for the solution of problems of high frequency acoustic scattering by sound-soft convex polygons, in which the approximation space is enriched with oscillatory basis functions which efficiently capture the high frequency asymptotics of the solution. We demonstrate, both theoretically and via numerical examples, exponential...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Computational Applied Mathematics
دوره 234 شماره
صفحات -
تاریخ انتشار 2010